Search results for " Dynamic memory"

showing 3 items of 3 documents

Improving the performance of embedded systems with variable neighborhood search

2017

Graphical abstractDisplay Omitted Embedded systems have become an essential part of our lives, mainly due to the evolution of technology in the last years. However, the power consumption of these devices is one of their most important drawbacks. It has been proven that an efficient use of the memory of the device also improves its energy performance. This work efficiently solves the dynamic memory allocation problem, which can be formally defined as follows: given a program that has to be executed by a circuit, the objective is to fit that program in memory in such a way that the computing time required to execute it is minimized. In this work, we propose a parallel variable neighborhood se…

021103 operations researchbusiness.industryComputer scienceC dynamic memory allocationEmbedded systemsWork (physics)0211 other engineering and technologies02 engineering and technologyMetaheuristics[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]Static memory allocationMemoryEmbedded system0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingDynamic memory allocationbusinessMetaheuristicSoftwareVariable neighborhood searchVariable neighborhood search
researchProduct

Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies

2015

International audience; Embedded systems have become an essential part of our lives, thanks to their evolution in the recent years, but the main drawback is their power consumption. This paper is focused on improving the memory allocation of embedded systems to reduce their power consumption. We propose a parallel variable neighborhood search algorithm for the dynamic memory allocation problem, and compare it with the state of the art. Computational results and statistical tests applied show that the proposed algorithm produces significantly better outcomes than the previous algorithm in shorter computing time.

Mathematical optimizationparallelismmetaheuristicsC dynamic memory allocationComputer sciencebusiness.industryApplied Mathematics[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]Static memory allocationPower consumptionEmbedded systemDiscrete Mathematics and Combinatoricsdynamic memory allocation problemembedded systemsState (computer science)businessMetaheuristicvariable neighborhood searchVariable neighborhood searchDrawbackStatistical hypothesis testing
researchProduct

Pedestrian Tracking in 360 Video by Virtual PTZ Cameras

2018

Since the data acquired by a PTZ camera change while adjusting the pan, tilt and zoom parameters, the results of tracking algorithms are difficult to reproduce; such diffi- culty limits the development and the comparison of tracking algorithms with PTZ cameras. The recently introduced 360- degree cameras acquire spherical views of the environment, generally stored as equirectangular images. Each pixel of an equirectangular image corresponds to a point on the spherical surface. A gnomonic projection can be used to project the points on the spherical surface onto a plane tangent to the sphere. Such tangent plane can be interpreted as the image plane of a virtual PTZ camera oriented towards th…

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniPixelComputer sciencebusiness.industryComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONImage planeTracking (particle physics)Gnomonic projectionAppearance models Dynamic memory Pedestrian tracking Spherical surface Tracking algorithm Tracking by detections Virtual cameraComputer Science::Computer Vision and Pattern RecognitionEquirectangular projectionComputer visionDevelopment (differential geometry)Artificial intelligenceZoombusinessTilt (camera)2018 IEEE 4th International Forum on Research and Technology for Society and Industry (RTSI)
researchProduct